TSTP Solution File: COM194^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : COM194^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 04:48:44 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 185
% Syntax : Number of formulae : 204 ( 15 unt; 181 typ; 0 def)
% Number of atoms : 149 ( 26 equ; 0 cnn)
% Maximal formula atoms : 3 ( 6 avg)
% Number of connectives : 31 ( 16 ~; 9 |; 0 &; 0 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 448 ( 443 >; 5 *; 0 +; 0 <<)
% Number of symbols : 175 ( 172 usr; 8 con; 0-6 aty)
% Number of variables : 103 ( 0 ^ 12 !; 0 ?; 103 :)
% ( 91 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
itself: $tType > $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_7,type,
n: $tType ).
thf(type_def_8,type,
t: $tType ).
thf(type_def_9,type,
dtree: $tType ).
thf(type_def_10,type,
sum_sum: ( $tType * $tType ) > $tType ).
thf(type_def_11,type,
set: $tType > $tType ).
thf(type_def_12,type,
product_prod: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
product_prod: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
sum_sum: ( $tType * $tType ) > $tType ).
thf(func_def_2,type,
dtree: $tType ).
thf(func_def_3,type,
set: $tType > $tType ).
thf(func_def_4,type,
t: $tType ).
thf(func_def_5,type,
n: $tType ).
thf(func_def_6,type,
itself: $tType > $tType ).
thf(func_def_7,type,
bounded_lattice:
!>[X0: $tType] : ( itself(X0) > $o ) ).
thf(func_def_8,type,
type:
!>[X0: $tType] : ( itself(X0) > $o ) ).
thf(func_def_9,type,
bot:
!>[X0: $tType] : ( itself(X0) > $o ) ).
thf(func_def_10,type,
top:
!>[X0: $tType] : ( itself(X0) > $o ) ).
thf(func_def_11,type,
bounded_lattice_top:
!>[X0: $tType] : ( itself(X0) > $o ) ).
thf(func_def_12,type,
node: n > set(sum_sum(t,dtree)) > dtree ).
thf(func_def_13,type,
cont: dtree > set(sum_sum(t,dtree)) ).
thf(func_def_14,type,
root: dtree > n ).
thf(func_def_15,type,
unfold:
!>[X0: $tType] : ( ( X0 > n ) > ( X0 > set(sum_sum(t,X0)) ) > X0 > dtree ) ).
thf(func_def_16,type,
comp:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X0 > X1 ) > ( X2 > X0 ) > X2 > X1 ) ).
thf(func_def_17,type,
gram_L861583724lle_Fr: set(n) > dtree > set(t) ).
thf(func_def_18,type,
gram_L1556062726le_Frr: set(n) > dtree > set(t) ).
thf(func_def_19,type,
gram_L1451583624elle_H: dtree > n > dtree ).
thf(func_def_20,type,
gram_L1221482011le_H_c: dtree > n > set(sum_sum(t,n)) ).
thf(func_def_21,type,
gram_L1221482026le_H_r: dtree > n > n ).
thf(func_def_22,type,
gram_L1451583628elle_L: set(n) > n > set(set(t)) ).
thf(func_def_23,type,
gram_L1451583632elle_P: set(product_prod(n,set(sum_sum(t,n)))) ).
thf(func_def_24,type,
gram_L1231612515_deftr: n > dtree ).
thf(func_def_25,type,
gram_L1004374585hsubst: dtree > dtree > dtree ).
thf(func_def_26,type,
gram_L1905609002ubst_c: dtree > dtree > set(sum_sum(t,dtree)) ).
thf(func_def_27,type,
gram_L1905609017ubst_r: dtree > n ).
thf(func_def_28,type,
gram_L1333338417e_inFr: set(n) > dtree > t > $o ).
thf(func_def_29,type,
gram_L805317441_inFr2: set(n) > dtree > t > $o ).
thf(func_def_30,type,
gram_L805317505_inFrr: set(n) > dtree > t > $o ).
thf(func_def_31,type,
gram_L830233218_inItr: set(n) > dtree > n > $o ).
thf(func_def_32,type,
gram_L315592705e_pick: dtree > n > dtree ).
thf(func_def_33,type,
gram_L1828378864e_rcut: dtree > dtree ).
thf(func_def_34,type,
gram_L1918716148le_reg: ( n > dtree ) > dtree > $o ).
thf(func_def_35,type,
gram_L646766332egular: dtree > $o ).
thf(func_def_36,type,
gram_L716654942_subtr: set(n) > dtree > dtree > $o ).
thf(func_def_37,type,
gram_L1283001940subtr2: set(n) > dtree > dtree > $o ).
thf(func_def_38,type,
gram_L1614515765ubtrOf: dtree > n > dtree ).
thf(func_def_39,type,
gram_L864798063lle_wf: dtree > $o ).
thf(func_def_40,type,
minus_minus:
!>[X0: $tType] : ( X0 > X0 > X0 ) ).
thf(func_def_41,type,
if:
!>[X0: $tType] : ( $o > X0 > X0 > X0 ) ).
thf(func_def_42,type,
sup_sup:
!>[X0: $tType] : ( X0 > X0 > X0 ) ).
thf(func_def_43,type,
bot_bot:
!>[X0: $tType] : X0 ).
thf(func_def_44,type,
top_top:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
product_Pair:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > product_prod(X0,X1) ) ).
thf(func_def_46,type,
type2:
!>[X0: $tType] : itself(X0) ).
thf(func_def_47,type,
collect:
!>[X0: $tType] : ( ( X0 > $o ) > set(X0) ) ).
thf(func_def_48,type,
insert:
!>[X0: $tType] : ( X0 > set(X0) > set(X0) ) ).
thf(func_def_49,type,
is_singleton:
!>[X0: $tType] : ( set(X0) > $o ) ).
thf(func_def_50,type,
vimage:
!>[X0: $tType,X1: $tType] : ( ( X0 > X1 ) > set(X1) > set(X0) ) ).
thf(func_def_51,type,
sum_Inl:
!>[X0: $tType,X1: $tType] : ( X0 > sum_sum(X0,X1) ) ).
thf(func_def_52,type,
sum_Inr:
!>[X0: $tType,X1: $tType] : ( X0 > sum_sum(X1,X0) ) ).
thf(func_def_53,type,
sum_rec_sum:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X0 > X1 ) > ( X2 > X1 ) > sum_sum(X0,X2) > X1 ) ).
thf(func_def_54,type,
member:
!>[X0: $tType] : ( X0 > set(X0) > $o ) ).
thf(func_def_55,type,
k: n > set(t) ).
thf(func_def_56,type,
ftr: n > dtree ).
thf(func_def_57,type,
n2: n ).
thf(func_def_58,type,
ns: set(n) ).
thf(func_def_59,type,
tns: set(sum_sum(t,n)) ).
thf(func_def_60,type,
tr: dtree ).
thf(func_def_61,type,
tr2: dtree ).
thf(func_def_65,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_66,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_67,type,
cCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X0 > X1 > X2 ) > X1 > X0 > X2 ) ).
thf(func_def_68,type,
sCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X0 > X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_69,type,
vAND: $o > $o > $o ).
thf(func_def_70,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_71,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_72,type,
iCOMB:
!>[X0: $tType] : ( X0 > X0 ) ).
thf(func_def_73,type,
vIMP: $o > $o > $o ).
thf(func_def_74,type,
vOR: $o > $o > $o ).
thf(func_def_75,type,
vNOT: $o > $o ).
thf(func_def_76,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_77,type,
sP0: set(n) > dtree > t > $o ).
thf(func_def_78,type,
sP1: dtree > set(n) > t > $o ).
thf(func_def_79,type,
sP2: dtree > set(n) > n > $o ).
thf(func_def_80,type,
sP3: dtree > set(n) > dtree > $o ).
thf(func_def_81,type,
sP4: set(n) > dtree > dtree > $o ).
thf(func_def_82,type,
sP5: ( set(n) > dtree > t > $o ) > $o ).
thf(func_def_83,type,
sP6: ( set(n) > dtree > t > $o ) > $o ).
thf(func_def_84,type,
sP7: ( set(n) > dtree > n > $o ) > $o ).
thf(func_def_85,type,
sP8: ( set(n) > dtree > dtree > $o ) > $o ).
thf(func_def_86,type,
sP9: ( set(n) > dtree > dtree > $o ) > $o ).
thf(func_def_87,type,
sP10: ( set(n) > dtree > dtree > $o ) > $o ).
thf(func_def_88,type,
sK11: n > dtree ).
thf(func_def_89,type,
sK12: n > dtree ).
thf(func_def_90,type,
sK13:
!>[X0: $tType] : X0 ).
thf(func_def_91,type,
sK14: n > set(sum_sum(t,n)) ).
thf(func_def_92,type,
sK15:
!>[X0: $tType] : ( set(X0) > X0 ) ).
thf(func_def_93,type,
sK16:
!>[X0: $tType] : ( set(X0) > X0 ) ).
thf(func_def_94,type,
sK17:
!>[X0: $tType] : ( set(X0) > X0 ) ).
thf(func_def_95,type,
sK18:
!>[X0: $tType] : ( set(X0) > X0 ) ).
thf(func_def_96,type,
sK19:
!>[X0: $tType] : ( set(X0) > X0 ) ).
thf(func_def_97,type,
sK20:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_98,type,
sK21:
!>[X0: $tType,X1: $tType] : ( sum_sum(X0,X1) > X1 ) ).
thf(func_def_99,type,
sK22:
!>[X0: $tType,X1: $tType] : ( sum_sum(X0,X1) > X0 ) ).
thf(func_def_100,type,
sK23:
!>[X0: $tType,X1: $tType] : ( sum_sum(X0,X1) > X1 ) ).
thf(func_def_101,type,
sK24:
!>[X0: $tType,X1: $tType] : ( sum_sum(X0,X1) > X0 ) ).
thf(func_def_102,type,
sK25:
!>[X0: $tType,X1: $tType] : ( sum_sum(X0,X1) > X1 ) ).
thf(func_def_103,type,
sK26:
!>[X0: $tType,X1: $tType] : ( sum_sum(X0,X1) > X0 ) ).
thf(func_def_104,type,
sK27: t > set(n) > dtree > dtree ).
thf(func_def_105,type,
sK28:
!>[X0: $tType] : ( set(X0) > X0 > set(X0) ) ).
thf(func_def_106,type,
sK29:
!>[X0: $tType] : ( set(X0) > X0 > set(X0) ) ).
thf(func_def_107,type,
sK30: set(n) > dtree > t > dtree ).
thf(func_def_108,type,
sK31: set(n) > dtree > t > dtree ).
thf(func_def_109,type,
sK32: set(n) > dtree > t > set(n) ).
thf(func_def_110,type,
sK33: dtree > set(n) > t > dtree ).
thf(func_def_111,type,
sK34: t > dtree > set(n) > dtree ).
thf(func_def_112,type,
sK35: dtree > set(n) > n > dtree ).
thf(func_def_113,type,
sK36: n > dtree > set(n) > dtree ).
thf(func_def_114,type,
sK37: dtree > set(n) > dtree > dtree ).
thf(func_def_115,type,
sK38: set(n) > dtree > dtree > dtree ).
thf(func_def_116,type,
sK39: dtree > dtree > n ).
thf(func_def_117,type,
sK40: ( dtree > dtree > $o ) > dtree ).
thf(func_def_118,type,
sK41: ( dtree > dtree > $o ) > dtree ).
thf(func_def_119,type,
sK42: ( dtree > dtree > $o ) > dtree ).
thf(func_def_120,type,
sK43: ( dtree > dtree > $o ) > dtree ).
thf(func_def_121,type,
sK44:
!>[X0: $tType,X1: $tType] : ( ( X1 > X0 ) > ( X1 > X0 ) > X1 ) ).
thf(func_def_122,type,
sK45:
!>[X0: $tType,X1: $tType] : ( ( sum_sum(X1,X0) > $o ) > X0 ) ).
thf(func_def_123,type,
sK46:
!>[X0: $tType,X1: $tType] : ( ( sum_sum(X1,X0) > $o ) > X1 ) ).
thf(func_def_124,type,
sK47: ( set(n) > dtree > t > $o ) > dtree ).
thf(func_def_125,type,
sK48: ( set(n) > dtree > t > $o ) > dtree ).
thf(func_def_126,type,
sK49: ( set(n) > dtree > t > $o ) > set(n) ).
thf(func_def_127,type,
sK50: ( set(n) > dtree > t > $o ) > t ).
thf(func_def_128,type,
sK51: ( set(n) > dtree > t > $o ) > dtree ).
thf(func_def_129,type,
sK52: ( set(n) > dtree > t > $o ) > set(n) ).
thf(func_def_130,type,
sK53: ( set(n) > dtree > t > $o ) > t ).
thf(func_def_131,type,
sK54: ( set(n) > dtree > t > $o ) > dtree ).
thf(func_def_132,type,
sK55: ( set(n) > dtree > t > $o ) > set(n) ).
thf(func_def_133,type,
sK56: ( set(n) > dtree > t > $o ) > dtree ).
thf(func_def_134,type,
sK57: ( set(n) > dtree > t > $o ) > t ).
thf(func_def_135,type,
sK58: ( set(n) > dtree > t > $o ) > dtree ).
thf(func_def_136,type,
sK59: ( set(n) > dtree > t > $o ) > set(n) ).
thf(func_def_137,type,
sK60: ( set(n) > dtree > t > $o ) > t ).
thf(func_def_138,type,
sK61: ( set(n) > dtree > n > $o ) > dtree ).
thf(func_def_139,type,
sK62: ( set(n) > dtree > n > $o ) > set(n) ).
thf(func_def_140,type,
sK63: ( set(n) > dtree > n > $o ) > dtree ).
thf(func_def_141,type,
sK64: ( set(n) > dtree > n > $o ) > n ).
thf(func_def_142,type,
sK65: ( set(n) > dtree > n > $o ) > dtree ).
thf(func_def_143,type,
sK66: ( set(n) > dtree > n > $o ) > set(n) ).
thf(func_def_144,type,
sK67: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_145,type,
sK68: ( set(n) > dtree > dtree > $o ) > set(n) ).
thf(func_def_146,type,
sK69: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_147,type,
sK70: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_148,type,
sK71: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_149,type,
sK72: ( set(n) > dtree > dtree > $o ) > set(n) ).
thf(func_def_150,type,
sK73: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_151,type,
sK74: ( set(n) > dtree > dtree > $o ) > set(n) ).
thf(func_def_152,type,
sK75: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_153,type,
sK76: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_154,type,
sK77: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_155,type,
sK78: ( set(n) > dtree > dtree > $o ) > set(n) ).
thf(func_def_156,type,
sK79: ( set(n) > dtree > dtree > $o ) > set(n) ).
thf(func_def_157,type,
sK80: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_158,type,
sK81: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_159,type,
sK82: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_160,type,
sK83: ( set(n) > dtree > dtree > $o ) > set(n) ).
thf(func_def_161,type,
sK84: ( set(n) > dtree > dtree > $o ) > dtree ).
thf(func_def_162,type,
sK85:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X1 > X0 ) > ( X0 > $o ) > X1 ) ).
thf(func_def_163,type,
sK86:
!>[X0: $tType,X1: $tType,X2: $tType] : ( $o > ( sum_sum(X0,X1) > X2 ) > X2 > X1 ) ).
thf(func_def_164,type,
sK87:
!>[X0: $tType,X1: $tType,X2: $tType] : ( $o > ( sum_sum(X0,X1) > X2 ) > X2 > X0 ) ).
thf(func_def_166,type,
sK89:
!>[X0: $tType] : ( X0 > set(X0) > X0 > set(X0) > set(X0) ) ).
thf(func_def_167,type,
sK90:
!>[X0: $tType] : ( set(X0) > ( X0 > $o ) > X0 ) ).
thf(func_def_168,type,
sK91:
!>[X0: $tType] : ( set(X0) > ( X0 > $o ) > X0 ) ).
thf(func_def_169,type,
sK92:
!>[X0: $tType] : ( set(X0) > ( X0 > $o ) > set(X0) > X0 ) ).
thf(func_def_170,type,
sK93:
!>[X0: $tType] : ( set(X0) > ( X0 > $o ) > set(X0) > X0 ) ).
thf(func_def_171,type,
sK94:
!>[X0: $tType] : ( set(X0) > ( X0 > $o ) > X0 ) ).
thf(func_def_172,type,
sK95:
!>[X0: $tType] : ( set(X0) > ( X0 > $o ) > X0 ) ).
thf(func_def_173,type,
sK96:
!>[X0: $tType] : ( set(X0) > X0 ) ).
thf(func_def_174,type,
sK97:
!>[X0: $tType] : ( set(X0) > X0 ) ).
thf(func_def_175,type,
sK98:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_176,type,
sK99:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(f2188,plain,
$false,
inference(subsumption_resolution,[],[f2187,f1427]) ).
thf(f1427,plain,
vAPP(dtree,$o,gram_L864798063lle_wf,tr2) = $true,
inference(cnf_transformation,[],[f641]) ).
thf(f641,plain,
vAPP(dtree,$o,gram_L864798063lle_wf,tr2) = $true,
inference(fool_elimination,[],[f640]) ).
thf(f640,plain,
vAPP(dtree,$o,gram_L864798063lle_wf,tr2),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
vAPP(dtree,$o,gram_L864798063lle_wf,tr2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_dtr) ).
thf(f2187,plain,
vAPP(dtree,$o,gram_L864798063lle_wf,tr2) != $true,
inference(subsumption_resolution,[],[f2186,f1788]) ).
thf(f1788,plain,
$true != vAPP(dtree,$o,gram_L864798063lle_wf,tr),
inference(forward_demodulation,[],[f1080,f1085]) ).
thf(f1085,plain,
tr = vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,tr2),tr2),
inference(cnf_transformation,[],[f2]) ).
thf(f2,axiom,
tr = vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,tr2),tr2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_tr_H__def) ).
thf(f1080,plain,
vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,tr2),tr2)) != $true,
inference(cnf_transformation,[],[f654]) ).
thf(f654,plain,
vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,tr2),tr2)) != $true,
inference(flattening,[],[f277]) ).
thf(f277,plain,
vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,tr2),tr2)) != $true,
inference(fool_elimination,[],[f276]) ).
thf(f276,plain,
~ vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,tr2),tr2)),
inference(rectify,[],[f273]) ).
thf(f273,negated_conjecture,
~ vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,tr2),tr2)),
inference(negated_conjecture,[],[f272]) ).
thf(f272,conjecture,
vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,tr2),tr2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(f2186,plain,
( ( $true = vAPP(dtree,$o,gram_L864798063lle_wf,tr) )
| ( vAPP(dtree,$o,gram_L864798063lle_wf,tr2) != $true ) ),
inference(duplicate_literal_removal,[],[f2185]) ).
thf(f2185,plain,
( ( $true = vAPP(dtree,$o,gram_L864798063lle_wf,tr) )
| ( vAPP(dtree,$o,gram_L864798063lle_wf,tr2) != $true )
| ( vAPP(dtree,$o,gram_L864798063lle_wf,tr2) != $true ) ),
inference(superposition,[],[f1170,f1085]) ).
thf(f1170,plain,
! [X0: dtree,X1: dtree] :
( ( $true = vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,X0),X1)) )
| ( $true != vAPP(dtree,$o,gram_L864798063lle_wf,X1) )
| ( $true != vAPP(dtree,$o,gram_L864798063lle_wf,X0) ) ),
inference(cnf_transformation,[],[f773]) ).
thf(f773,plain,
! [X0: dtree,X1: dtree] :
( ( $true = vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,X0),X1)) )
| ( $true != vAPP(dtree,$o,gram_L864798063lle_wf,X1) )
| ( $true != vAPP(dtree,$o,gram_L864798063lle_wf,X0) ) ),
inference(flattening,[],[f772]) ).
thf(f772,plain,
! [X0: dtree,X1: dtree] :
( ( $true = vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,X0),X1)) )
| ( $true != vAPP(dtree,$o,gram_L864798063lle_wf,X1) )
| ( $true != vAPP(dtree,$o,gram_L864798063lle_wf,X0) ) ),
inference(ennf_transformation,[],[f381]) ).
thf(f381,plain,
! [X0: dtree,X1: dtree] :
( ( $true = vAPP(dtree,$o,gram_L864798063lle_wf,X0) )
=> ( ( $true = vAPP(dtree,$o,gram_L864798063lle_wf,X1) )
=> ( $true = vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,X0),X1)) ) ) ),
inference(fool_elimination,[],[f380]) ).
thf(f380,plain,
! [X0: dtree,X1: dtree] :
( vAPP(dtree,$o,gram_L864798063lle_wf,X0)
=> ( vAPP(dtree,$o,gram_L864798063lle_wf,X1)
=> vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,X0),X1)) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X4: dtree,X5: dtree] :
( vAPP(dtree,$o,gram_L864798063lle_wf,X4)
=> ( vAPP(dtree,$o,gram_L864798063lle_wf,X5)
=> vAPP(dtree,$o,gram_L864798063lle_wf,vAPP(dtree,dtree,vAPP(dtree,sTfun(dtree,dtree),gram_L1004374585hsubst,X4),X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_wf__hsubst) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM194^1 : TPTP v8.1.2. Released v7.0.0.
% 0.07/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 21:25:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % (30111)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37 % (30119)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.38 % (30115)WARNING: value z3 for option sas not known
% 0.13/0.38 % (30114)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.38 % (30113)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.38 % (30116)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.38 % (30117)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.38 % (30115)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.38 % (30118)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.20/0.44 % (30119)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.46 % Exception at run slice level
% 0.20/0.46 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.46 % Exception at run slice level
% 0.20/0.46 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.47 % Exception at run slice level
% 0.20/0.47 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.48 % (30120)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.20/0.48 % (30121)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.20/0.49 % (30122)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.20/0.50 % (30115)First to succeed.
% 0.20/0.50 % (30115)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30111"
% 0.20/0.51 % (30115)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (30115)------------------------------
% 0.20/0.51 % (30115)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.51 % (30115)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (30115)Memory used [KB]: 2614
% 0.20/0.51 % (30115)Time elapsed: 0.129 s
% 0.20/0.51 % (30115)Instructions burned: 306 (million)
% 0.20/0.51 % (30111)Success in time 0.144 s
%------------------------------------------------------------------------------